Neutro-Connectedness Cut

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Region-Based Segmentation: Fuzzy Connectedness, Graph Cut and Related Algorithms

In this chapter, we will review the current state of knowledge on regionbased digital image segmentation methods. More precisely, we will concentrate on the four families of such algorithms: (a) The leading theme here will be the framework of fuzzy connectedness (FC) methods. (b) We will also discuss in detail the family of graph cut (GC) methods and their relations to the FC family of algorith...

متن کامل

Joint graph cut and relative fuzzy connectedness image segmentation algorithm

We introduce an image segmentation algorithm, called GC(sum)(max), which combines, in novel manner, the strengths of two popular algorithms: Relative Fuzzy Connectedness (RFC) and (standard) Graph Cut (GC). We show, both theoretically and experimentally, that GC(sum)(max) preserves robustness of RFC with respect to the seed choice (thus, avoiding "shrinking problem" of GC), while keeping GC's s...

متن کامل

Comparison of fuzzy connectedness and graph cut segmentation algorithms

The goal of this paper is a theoretical and experimental comparison of two popular image segmentation algorithms: fuzzy connectedness (FC) and graph cut (GC). On the theoretical side, our emphasis will be on describing a common framework in which both of these methods can be expressed. We will give a full analysis of the framework and describe precisely a place which each of the two methods occ...

متن کامل

Contents 11 Region - Based Segmentation : Fuzzy Connectedness , Graph Cut and Related Algorithms

In this chapter, we will review the current state of knowledge on regionbased digital image segmentation methods. More precisely, we will concentrate on the four families of such algorithms: (i) The leading theme here will be the framework of fuzzy connectedness (FC) methods. (ii) We will also discuss in detail the family of graph cut (GC) methods and their relations to the FC family of algorit...

متن کامل

Entropy, neutro-entropy and anti-entropy for neutrosophic information

This article shows a deca-valued representation of neutrosophic information in which are defined the following features: truth, falsity, weak truth, weak falsity, ignorance, contradiction, saturation, neutrality, ambiguity and hesitation. Using these features, there are constructed computing formulas for entropy, neutro-entropy and anti-entropy.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Image Processing

سال: 2016

ISSN: 1057-7149,1941-0042

DOI: 10.1109/tip.2016.2594485